منابع مشابه
Multiset and Set Decipherable Codes
we extend some results of Lempel and Restive on multiset decipherable codes to set decipherable codes. @ 2001 Elsevier Science Ltd. All rights reserved. Keywords-Codes, Unique decipherability, Multiset decipherability, Dominoes, Set decipherability.
متن کاملDecidability of multiset, set and numerically decipherable directed figure codes
Codes with various kinds of decipherability, weaker than the usual unique decipherability, have been studied since multiset decipherability was introduced in mid-1980s. We consider decipherability of directed figure codes, where directed figures are defined as labelled polyominoes with designated start and end points, equipped with catenation operation that may use a merging function to resolve...
متن کاملOn McMillan's theorem about uniquely decipherable codes
Let len : A −→ N be the length function on the free monoid of all strings over a given non-empty finite set A. Let con : A −→ A be the concatenation map which to every string of strings associates their concatenation. A uniquely decipherable code is a finite set C ⊆ A such that con is injective on the submonoid C of A. This submonoid is then isomorphic to the submonoid C = con[C] of A freely ge...
متن کاملMultiset Codes for Permutation Channels
This paper introduces the notion of multiset codes as relevant to the problem of reliable information transmission over permutation channels. The motivation for studying permutation channels comes from the effect of out of order delivery of packets in some types of packet networks. The proposed codes are a generalization of the so-called subset codes, recently proposed by the authors. Some of t...
متن کاملDisjoint, Partition and Intersection Constraints for Set and Multiset Variables
We have started a systematic study of global constraints on set and multiset variables. We consider here disjoint, partition, and intersection constraints. These global constraints fall into one of three classes. In the first class, we show that we can decompose the constraint without hindering bound consistency. No new algorithms therefore need be developed for such constraints. In the second ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2001
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(01)00096-7